Continua in which all connected subsets are arcwise connected

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simply Connected Homogeneous Continua Are Not Separated by Arcs

We show that locally connected, simply connected homogeneous continua are not separated by arcs. We ask several questions about homogeneous continua which are inspired by analogous questions in geometric group theory.

متن کامل

Below all subsets for Minimal Connected Dominating Set

A vertex subset S in a graph G is a dominating set if every vertex not contained in S has a neighbor in S. A dominating set S is a connected dominating set if the subgraph G[S] induced by S is connected. A connected dominating set S is a minimal connected dominating set if no proper subset of S is also a connected dominating set. We prove that there exists a constant ǫ > 10 such that every grap...

متن کامل

Colouring Arcwise Connected Sets in the Plane II

Let G be the family of nite collections S where S is a collection of closed, bounded, arcwise connected sets in R 2 which for any S; T 2 S where S \ T 6 = ;, it holds that S \ T is arcwise connected. Given S 2 G which is triangle-free, we show that provided S is suu-ciently large there exists a subcollection S 0 S of at most 5 sets with the property that the sets of S surrounded by S 0 induce a...

متن کامل

Colouring Arcwise Connected Sets in the Plane I

Let G be the family of ®nite collections S where S is a collection of bounded, arcwise connected sets in R which for any S;T A S where S VT 0h, it holds that S VT is arcwise connected. We investigate the problem of bounding the chromatic number of the intersection graph G of a collection S A G. Assuming G is triangle-free, suppose there exists a closed Jordan curve C HR such that C intersects a...

متن کامل

Incomputability of Simply Connected Planar Continua

Le Roux and Ziegler asked whether every simply connected compact nonempty planar Π 1 set always contains a computable point. In this paper, we solve the problem of le Roux and Ziegler by showing that there exists a planar Π 1 dendroid without computable points. We also provide several pathological examples of tree-like Π 1 continua fulfilling certain global incomputability properties: there is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1975

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1975-0365523-2